Total Edge Irregularity Strength of The Cartesian Product of Bipartite Graphs and Paths

- Wijaya, Rachel Wulan Nirmalasari, Ryan, Joe, Kalinowski, Thomas

Feasible bases for a polytope related to the Hamilton cycle problem

- Kalinowski, Thomas, Mohammadian, Sogol

Extended formulations for convex hulls of some bilinear functions

- Gupte, Akshay, Kalinowski, Thomas, Rigterink, Fabian, Waterer, Hamish

Hamiltonian cycles and subsets of discounted occupational measures

- Eshragh, Ali, Filar, Jerzy A., Kalinowski, Thomas, Mohammadian, Sogol

Scheduling of maintenance windows in a mining supply chain rail network

- Kalinowski, Thomas, Matthews, Jason, Waterer, Hamish

Minimum rank and zero forcing number for butterfly networks

- Ferrero, Daniela, Grigorious, Cyriac, Kalinowski, Thomas, Ryan, Joe, Stephen, Sudeep

Zero forcing in iterated line digraphs

- Ferrero, Daniela, Kalinowski, Thomas, Stephen, Sudeep

A lower bound on the zero forcing number

- Davila, Randy, Kalinowski, Thomas, Stephen, Sudeep

On the power domination number of de Bruijn and Kautz digraphs

- Grigorious, Cyraic, Kalinowski, Thomas, Stephen, Sudeep

Resource considerations for integrated planning of railway traffic and maintenance windows

- Lidén, Tomas, Kalinowski, Thomas, Waterer, Hamish

A polynomially solvable case of the pooling problem

- Boland, Natashia, Kalinowski, Thomas, Rigterink, Fabian

Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions

- Boland, Natashia, Dey, Santanu S., Kalinowski, Thomas, Molinaro, Marco, Rigterink, Fabian

H-supermagic labelings for firecrackers, banana trees and flowers

- Wijaya, Rachel Wulan Nirmalasari, Semanicová-Fenovcíková, Andrea, Ryan, Joe, Kalinowski, Thomas

Incremental network design with minimum spanning trees

- Engel, Konrad, Kalinowski, Thomas, Savelsbergh, Martin W. P.

Maintenance scheduling in a railway corridor

- Eskandarzadeh, Saman, Kalinowski, Thomas, Waterer, Hamish

Scheduling reclaimers serving a stock pad at a coal terminal

- Kalinowski, Thomas, Kapoor, Reena, Savelsbergh, Martin W. P.

The metric dimension of the circulant graph C(n,±{1,2,3,4})

- Grigorious, Cyriac, Kalinowski, Thomas, Ryan, Joe, Stephen, Sudeep

The network maintenance problem

- Charkhgard, Parisa, Kalinowski, Thomas, Waterer, Hamish

A reclaimer scheduling problem arising in coal stockyard management

- Angelelli, Enrico, Kalinowski, Thomas, Kapoor, Reena, Savelsbergh, Martin W.

Minimizing the regularity of maximal regular antichains of 2- and 3-sets

- Kalinowski, Thomas, Leck, Uwe, Reiher, Christian, Roberts, Ian T.